Multi-hop Byzantine reliable broadcast with honest dealer made practical

We revisit Byzantine tolerant reliable broadcast with honest dealer algorithms in multi-hop networks. To tolerate Byzantine faulty nodes arbitrarily spread over the network, previous solutions require a factorial number of messages to be sent over the network if the messages are not authenticated (e.g., digital signatures are not available). We propose modifications that preserve the safety and liveness properties of the original unauthenticated protocols, while highly decreasing their observed message complexity when simulated on several classes of graph topologies, potentially opening to their employment

Probabilistic View of Explosion in an Inelastic Kac Model

Let $\{\mu(\cdot,t):t\geq0\}$ be the family of probability measures corresponding to the solution of the inelastic Kac model introduced in Pulvirenti and Toscani [\textit{J. Stat. Phys.} \textbf{114} (2004) 1453-1480]. It has been proved by Gabetta and Regazzini [\textit{J. Statist. Phys.} \textbf{147} (2012) 1007-1019] that the solution converges weakly to equilibrium if and only if a suitable symmetrized form of the initial data belongs to the standard domain of attraction of a specific stable law. In the present paper it is shown that, for initial data which are heavier-tailed than the aforementioned ones, the limiting distribution is improper in the sense that it has probability 1/2 "adherent" to $-\infty$ and probability 1/2 "adherent" to $+\infty$. It is explained in which sense this phenomenon is amenable to a sort of explosion, and the main result consists in an explicit expression of the rate of such an explosion. The presentation of these statements is preceded by a discussion about the necessity of the assumption under which their validity is proved. This gives the chance to make an adjustment to a portion of a proof contained in the above-mentioned paper by Gabetta and Regazzini

B-CoC: A Blockchain-Based Chain of Custody for Evidences Management in Digital Forensics

One of the main issues in digital forensics is the management of evidences. From the time of evidence collection until the time of their exploitation in a legal court, evidences may be accessed by multiple parties involved in the investigation that take temporary their ownership. This process, called Chain of Custody (CoC), must ensure that evidences are not altered during the investigation, despite multiple entities owned them, in order to be admissible in a legal court. Currently digital evidences CoC is managed entirely manually with entities involved in the chain required to fill in documents accompanying the evidence. In this paper, we propose a Blockchain-based Chain of Custody (B-CoC) to dematerialize the CoC process guaranteeing auditable integrity of the collected evidences and traceability of owners. We developed a prototype of B-CoC based on Ethereum and we evaluated its performance

Tight Mobile Byzantine Tolerant Atomic Storage

This paper proposes the first implementation of an atomic storage tolerant to mobile Byzantine agents. Our implementation is designed for the round-based synchronous model where the set of Byzantine nodes changes from round to round. In this model we explore the feasibility of multi-writer multi-reader atomic register prone to various mobile Byzantine behaviors. We prove upper and lower bounds for solving the atomic storage in all the explored models. Our results, significantly different from the static case, advocate for a deeper study of the main building blocks of distributed computing while the system is prone to mobile Byzantine failures

Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems

A stabilizing Byzantine single-writer single-reader (SWSR) regular register, which stabilizes after the first invoked write operation, is first presented. Then, new/old ordering inversions are eliminated by the use of a (bounded) sequence number for writes, obtaining a practically stabilizing SWSR atomic register. A practically stabilizing Byzantine single-writer multi-reader (SWMR) atomic register is then obtained by using several copies of SWSR atomic registers. Finally, bounded time-stamps, with a time-stamp per writer, together with SWMR atomic registers, are used to construct a practically stabilizing Byzantine multi-writer multi-reader (MWMR) atomic register. In a system of $n$ servers implementing an atomic register, and in addition to transient failures, the constructions tolerate t<n/8 Byzantine servers if communication is asynchronous, and t<n/3 Byzantine servers if it is synchronous. The noteworthy feature of the proposed algorithms is that (to our knowledge) these are the first that build an atomic read/write storage on top of asynchronous servers prone to transient failures, and where up to t of them can be Byzantine

Building Regular Registers with Rational Malicious Servers and Anonymous Clients

The paper addresses the problem of emulating a regular register in a synchronous distributed system where clients invoking $$\mathsf{read}()$$ and $$\mathsf{write}()$$ operations are anonymous while server processes maintaining the state of the register may be compromised by rational adversaries (i.e., a server might behave as rational malicious Byzantine process). We first model our problem as a Bayesian game between a client and a rational malicious server where the equilibrium depends on the decisions of the malicious server (behave correctly and not be detected by clients vs returning a wrong register value to clients with the risk of being detected and then excluded by the computation). We prove such equilibrium exists and finally we design a protocol implementing the regular register that forces the rational malicious server to behave correctly

Antiproton annihilation on light nuclei at very low energies

The recent experimental data obtained by the OBELIX group on $\bar{p}$D and $\bar{p}^4$He total annihilation cross sections are analyzed. The combined analysis of these data with existing antiprotonic atom data allows, for the first time, the imaginary parts of the S-wave scattering lengths for the two nuclei to be extracted. The obtained values are: $Im a^{sc}_0 = [- 0.62 \pm 0.02 ({stat}) \pm 0.04 ({sys})] fm$ for $\bar{p}$D and $Im a^{sc}_0 = [- 0.36\pm 0.03({stat})^{+0.19}_{-0.11}({sys})] fm$ for $\bar{p}^4$He. This analysis indicates an unexpected behaviour of the imaginary part of the $\bar{p}$-nucleus S-wave scattering length as a function of the atomic weight A: $|Im a^{sc}_0|$ ($\bar{p}$p) > $|Im a^{sc}_0|$ ($\bar{p}$D) > $|Im a^{sc}_0|$ ($\bar{p}^4$He).Comment: 13 pages, 5 figure

Vučić’s plebiscite almost slipped on arithmetics. EPC Commentary, 29 April 2016

As largely anticipated, the incumbent Prime Minister of Serbia, Aleksandar Vučić, secured another four years in power at the snap elections that took place on 24 April. However, the results suggest that Vučić has overplayed his hand with this personal plebiscite: simple arithmetics unmasked his exaggerated hope to wipe out the opposition and consolidate political dominance. This might bode well for political pluralism but voters’ preferences and the affixed party options caution against taking Serbia’s commitment to European integration for granted